Dimensional operators for mathematical morphology on simplicial complexes
نویسندگان
چکیده
منابع مشابه
Dimensional operators for mathematical morphology on simplicial complexes
In this work we study the framework of mathematical morphology on simplicial complex spaces. Simplicial complexes are widely used to represent multidimensional data, such as meshes, that are two dimensional complexes, or graphs, that can be interpreted as one dimensional complexes. Mathematical morphology is one of the most powerful frameworks for image processing, including the processing of d...
متن کاملNew methods for constructing shellable simplicial complexes
A clutter $mathcal{C}$ with vertex set $[n]$ is an antichain of subsets of $[n]$, called circuits, covering all vertices. The clutter is $d$-uniform if all of its circuits have the same cardinality $d$. If $mathbb{K}$ is a field, then there is a one-to-one correspondence between clutters on $V$ and square-free monomial ideals in $mathbb{K}[x_1,ldots,x_n]$ as follows: To each clutter $mathcal{C}...
متن کاملEmbedding graphs into two-dimensional simplicial complexes
We consider the problem of deciding whether an input graph G admits a topological embedding into a two-dimensional simplicial complex C . This problem includes, among others, the embeddability problem of a graph on a surface and the topological crossing number of a graph, but is more general. The problem is NP-complete when C is part of the input, and we give a polynomial-time algorithm if the ...
متن کاملFlows on Simplicial Complexes
Given a graph G, the number of nowhere-zero Zq-flows φG(q) is known to be a polynomial in q. We extend the definition of nowhere-zero Zq-flows to simplicial complexes ∆ of dimension greater than one, and prove the polynomiality of the corresponding function φ∆(q) for certain q and certain subclasses of simplicial complexes. Résumé. Et́ant donné une graphe G, on est connu que le nombre de Zq-flot...
متن کاملMathematical Morphology Operators over Concept Lattices
Although mathematical morphology and formal concept analysis are two lattice-based data analysis theories, they are still developed in two disconnected research communities. The aim of this paper is to contribute to fill this gap, beyond the classical relationship between the Galois connections defined by the derivation operators and the adjunctions underlying the algebraic mathematical morphol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition Letters
سال: 2014
ISSN: 0167-8655
DOI: 10.1016/j.patrec.2014.01.006